On the Unimodality of Independence Polynomial of Certain Classes of Graphs
نویسندگان
چکیده
The independence polynomial of a graph G is the polynomial ∑ ikx , where ik denote the number of independent sets of cardinality k in G. In this paper we study unimodality problem for the independence polynomial of certain classes of graphs.
منابع مشابه
The unimodality of independence polynomials of some graphs
In this paper we study unimodality problems for the independence polynomial of a graph, including unimodality, log-concavity and reality of zeros. We establish recurrence relations and give factorizations of independence polynomials for certain classes of graphs. As applications we settle some unimodality conjectures and problems. © 2010 Elsevier Ltd. All rights reserved.
متن کاملON THE EDGE COVER POLYNOMIAL OF CERTAIN GRAPHS
Let $G$ be a simple graph of order $n$ and size $m$.The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set. The edge cover polynomial of $G$ is the polynomial$E(G,x)=sum_{i=rho(G)}^{m} e(G,i) x^{i}$,where $e(G,i)$ is the number of edge coverings of $G$ of size $i$, and$rho(G)$ is the edge covering number of $G$. In this paper we stud...
متن کامل2 9 Se p 20 13 Operations of graphs and unimodality of independence polynomials ∗
Given two graphs G and H, assume that C = {C1, C2, . . . , Cq} is a clique cover of G and U is a subset of V (H). We introduce a new graph operation called the clique cover product, denoted by G ⋆ HU , as follows: for each clique Ci ∈ C , add a copy of the graph H and join every vertex of Ci to every vertex of U . We prove that the independence polynomial of G ⋆ HU I(G ⋆ H ;x) = I(H;x)I(G; xI(H...
متن کاملSymmetry and unimodality of independence polynomials of path-like graphs
We prove the symmetry and unimodality of the independence polynomials of various graphs constructed by means of a recursive “path-like” construction. Our results provide a substantial generalization of the work of Zhu [Australas. J. Combin. 38 (2007), 27–33] and others.
متن کاملA Family of Well-Covered Graphs with Unimodal Independence Polynomials
T. S. Michael and N. Traves (2002) provided examples of wellcovered graphs whose independence polynomials are not unimodal. A. Finbow, B. Hartnell and R. J. Nowakowski (1993) proved that under certain conditions, any well-covered graph equals G∗ for some G, where G∗ is the graph obtained from G by appending a single pendant edge to each vertex of G. Y. Alavi, P. J. Malde, A. J. Schwenk and P. E...
متن کامل